Inapproximability of some art gallery problems
نویسندگان
چکیده
We prove that the three art gallery problems Vertex Guard, Edge Guard and Point Guard for simple polygons with holes cannot be approximated by any polynomial time algorithm with a ratio of 1? 28 ln n, for any > 0, unless N P T IM E(n O(log log n)). We obtain our results by extending and modifying the concepts of a construction introduced in Eide98].
منابع مشابه
The Inapproximability of Illuminating Polygons by α-Floodlights
We consider variants of the art gallery problem where guard visibility is limited to a certain angular aperture α. We show that the problem is NP-hard even when guards can be located in the interior of the polygon. We then proceed to prove that both this problem and its vertex variant, where guard placement is restricted to the vertices of the polygon, are APX-hard. We observe that earlier cons...
متن کاملInapproximability Results for Guarding Polygons and Terrains 1
Past research on art gallery problems has concentrated almost exclusively on bounds on the numbers of guards needed in the worst case in various settings. On the complexity side, fewer results are available. For instance, it has long been known that placing a smallest number of guards for a given input polygon is NP-hard. In this paper we initiate the study of the approximability of several typ...
متن کاملInapproximability Results for Guarding Polygons without Holes
The three art gallery problems Vertex Guard, Edge Guard and Point Guard are known to be NP -hard [8]. Approximation algorithms for Vertex Guard and Edge Guard with a logarithmic ratio were proposed in [7]. We prove that for each of these problems, there exists a constant > 0, such that no polynomial time algorithm can guarantee an approximation ratio of 1 + unless P = NP . We obtain our results...
متن کاملArt Gallery and Illumination Problems
How many guards are necessary, and how many are sufficient to patrol the paintings and works of art in an art gallery with n walls? This wonderfully na¨ıve question of combinatorial geometry has, since its formulation, stimulated an increasing number of of papers and surveys. In 1987, J. O'Rourke published his book Art Gallery Theorems and Algorithms which has further fueled this area of resear...
متن کاملA Decentralized Approach to the Art Gallery Problem
With the increasing interest in ubiquitous computing and mobile robotics, distributed algorithms for solving computational geometry problems in a decentralized fashion will grow in importance. This paper describes a mapping of discretized variants of the art gallery problem to a distributed constraint optimization problem. A testbed using several complete, optimal, distributed algorithms is pre...
متن کامل